- completeness property
- свойство полноты шифрования (каждым выходной бит шифра является функцией всех входных битов).
English-Russian cryptological dictionary . 2014.
Смотреть что такое "completeness property" в других словарях:
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
Completeness axiom — In mathematics the completeness axiom, also called Dedekind completeness of the real numbers, is a fundamental property of the set R of real numbers. It is the property that distinguishes R from other ordered fields, especially from the set of… … Wikipedia
Completeness of the real numbers — Intuitively, completeness implies that there are not any “gaps” (in Dedekind s terminology) or “missing points” in the real number line. This contrasts with the rational numbers, whose corresponding number line has a “gap” at each irrational… … Wikipedia
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
Completeness (statistics) — In statistics, completeness is a property of a statistic in relation to a model for a set of observed data. In essence, it is a condition which ensures that the parameters of the probability distribution representing the model can all be… … Wikipedia
completeness — complete ► ADJECTIVE 1) having all the necessary or appropriate parts; entire. 2) having run its full course; finished. 3) to the greatest extent or degree; total. 4) skilled at every aspect of an activity: the complete footballer. 5) (complete… … English terms dictionary
Completeness (cryptography) — In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits. This is a desirable property to have in an encryption cipher, so that if one bit of the input (plaintext) is changed, every bit… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Least-upper-bound property — In mathematics, the least upper bound property is a fundamental property of the real numbers and certain other ordered sets. The property states that any non empty set of real numbers that has an upper bound necessarily has a least upper bound… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
Functional completeness — In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well known complete set of… … Wikipedia